Search results for "binary [neutron star]"
showing 10 items of 544 documents
Isobaric Vapor−Liquid Equilibria for 1-Propanol + Water + Calcium Nitrate
1999
Isobaric vapor−liquid equilibria for all of the binary and ternary mixtures of 1-propanol, water, and calcium nitrate have been measured at 100.00 kPa using a recirculating still. The addition of calcium nitrate to the solvent mixture produced an important salt effect; the azeotrope was removed at salt mole fractions higher than 0.08. The three experimental binary data sets were independently fitted with the electrolyte NRTL model (Mock, B.; Evans, L. B.; Chen, C. C. AIChE J. 1986, 32, 1655−1664), and the parameters of Mock's model were estimated for each binary system. No ternary parameter was required. These parameters were used to predict the ternary vapor−liquid equilibrium using the sa…
Isobaric Vapor−Liquid Equilibria for Water + Acetic Acid + Lithium Acetate
2001
Isobaric vapor−liquid equilibria for all of the binary and ternary mixtures of water, acetic acid, and lithium acetate have been measured at 100.00 kPa using a recirculating still. To take into account the association of the acetic acid in the vapor phase, Marek's chemical theory has been considered. The three experimental binary data sets have been independently correlated using Mock's electrolyte NRTL model, and the binary parameters estimated for each binary system have been used to predict the ternary vapor−liquid equilibrium using the same model. No ternary parameters were required. The ternary equilibrium values obtained in this way agreed well with the experimental values.
Isobaric Vapor−Liquid and Liquid−Liquid Equilibria for Chloroform + Methanol + 1-Ethyl-3-methylimidazolium Trifluoromethanesulfonate at 100 kPa
2009
Isobaric vapor−liquid equilibria for the binary system chloroform + methanol as well as the vapor−liquid equilibria for the chloroform + methanol + [emim][triflate] ternary system have been obtained at 100 kPa using a recirculating still. The ternary ionic liquid (IL) system presents an immiscibility zone at high chloroform composition, which increases with the temperature. Liquid−liquid equilibria for this system have also been determined. The measured ternary vapor−liquid equilibrium data were correlated using the Mock’s electrolyte nonrandom two-liquid (NRTL) model which reproduces reasonably well the experimental values and predicts the total disappearance of the azeotrope when the mole…
Complex miscibility behaviour for polymer blends in flow
1995
Abstract Experimental observations of the effect of shear flow on the miscibility of binary polymer blends are compared to calculations based on a generalized Gibbs energy of mixing Gγ˙. This mixing free energy characterizes the steady state established at shear rateγ˙, as the sum of G z , the equilibrium Gibbs energy and E s , the energy the system stores while flowing.
Distributed Pseudo-Gossip Algorithm and Finite-Length Computational Codes for Efficient In-Network Subspace Projection
2013
In this paper, we design a practical power-efficient algorithm for Wireless Sensor Networks (WSN) in order to obtain, in a distributed manner, the projection of an observed sampled spatial field on a subspace of lower dimension. This is an important problem that is motivated in various applications where there are well defined subspaces of interest (e.g., spectral maps in cognitive radios). As opposed to traditional Gossip Algorithms used for subspace projection, where separation of channel coding and computation is assumed, our algorithm combines binary finite-length Computational Coding and a novel gossip-like protocol with certain communication rules, achieving important savings in conve…
Balance Properties and Distribution of Squares in Circular Words
2008
We study balance properties of circular words over alphabets of size greater than two. We give some new characterizations of balanced words connected to the Kawasaki-Ising model and to the notion of derivative of a word. Moreover we consider two different generalizations of the notion of balance, and we find some relations between them. Some of our results can be generalised to non periodic infinite words as well.
Weak associativity and restricted rotation
2009
A restricted rotation induced by a weak associative law is introduced. The corresponding equivalence relation is identical to the Glivenko congruence on Tamari lattices, i.e. lattices of binary trees endowed by the well-known rotation operation.
Balanced Words Having Simple Burrows-Wheeler Transform
2009
The investigation of the "clustering effect" of the Burrows-Wheeler transform (BWT) leads to study the words having simple BWT , i.e. words w over an ordered alphabet $A=\{a_1,a_2,\ldots,a_k\}$, with $a_1 < a_2 < \ldots <a_k$, such that $bwt(w)$ is of the form $a_k^{n_k} a_{k-1}^{n_{k-1}} \cdots a_1^{n_1}$, for some non-negative integers $n_1, n_2, \ldots, n_k$. We remark that, in the case of binary alphabets, there is an equivalence between words having simple BWT, the family of (circular) balanced words and the conjugates of standard words. In the case of alphabets of size greater than two, there is no more equivalence between these notions. As a main result of this paper we prove that, u…
When can an equational simple graph be generated by hyperedge replacement?
1998
Infinite hypergraphs with sources arise as the canonical solutions of certain systems of recursive equations written with operations on hypergraphs. There are basically two different sets of such operations known from the literature, HR and VR. VR is strictly more powerful than HR on simple hypergraphs. Necessary conditions are known ensuring that a VR-equational simple hypergraph is also HR-equational. We prove that two of them, namely having finite tree-width or not containing the infinite bipartite graph, are also sufficient. This shows that equational hypergraphs behave like context-free sets of finite hypergraphs.
Ranking and unrankingk-ary trees with a 4k –4 letter alphabet
1997
Abstract The problem of the direct generation in A-order of binary trees was stated by Zaks in 1980. In 1988 Roelants van Baronaigien and Ruskey gave a solution for k-ary trees with n internal nodes using an encoding sequence of kn+1 integers between 1 and n. Vajnovszki and Pallo improved this result for binary trees in 1994 using words of length n–1 on a four letter alphabet. Recently Korsh generalized the Vajnovszki and Pallo’s generating algorithm to k-ary trees using an alphabet whose cardinality depends on k but not on n. We give in this paper ranking and unranking algorithms for k-ary trees using the Korsh’s encoding scheme.